Location:
Search - NFA DFA
Search list
Description: 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors
Platform: |
Size: 18432 |
Author: dai |
Hits:
Description: 把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。
-NFA into a DFA to determine the algorithm to achieve a given NFA M, to determine into a DFA M ' , then the DFA M state minimization, given DFA M of finite state set S is divided into several disjoint subset, such that: any two different subset of the state are distinguishable, and the same subset of any two states are equivalent (to take advantage of Ia function, but does not need to construct ε-CLOSURE function, because This is a DFA). Output of the simplified DFA M ' .
Platform: |
Size: 2048 |
Author: 王静晓 |
Hits:
Description: 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular grammar G, write a regular expression RE 3, according to the regular expression RE, draw the NFA 4, the NFA into a DFA 5, the DFA conversion the mininum state DFA 6, mininum state DFA is the lexical analysis process flow chart, flow chart according to the preparation of the corresponding lexical analyzer.
Platform: |
Size: 6144 |
Author: 晓 |
Hits:
Description: 正规式转化为NFA,NFA转化为DFA及DFA的最小化-NFA change into DFA
Platform: |
Size: 1035264 |
Author: 流木0911 |
Hits:
Description: MFC实现的正规式的输入，转化为NFA,转化为DFA,转化为最简DFA的程序-use MFC to operate something about NFA
Platform: |
Size: 4697088 |
Author: 流木0911 |
Hits:
Description: 将输入的正规式转换为NFA,再转换为DFA.因为时间很赶，所以结构不太合理。注释也不详细。-change from regular express to DFA
Platform: |
Size: 46080 |
Author: 蓝 |
Hits:
Description: Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2-Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2
Platform: |
Size: 1024 |
Author: Merwyn |
Hits:
Description: 正规式转DFA，包括正规式转NFA，NFA转DFA等-Formal type turn DFA, including regular type turn NFA, turn NFA DFA, etc..
Platform: |
Size: 5120 |
Author: 黄正华 |
Hits:
Description: 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
Platform: |
Size: 84992 |
Author: 若若 |
Hits:
Description: this program will convert ndfa to dfa
Platform: |
Size: 1024 |
Author: sumit |
Hits:
Description: 确定化NFA转化为DFA，这个c++代码用于将NFA转化为DFA ,可以编译通过-The Determination of NFA into DFA
Platform: |
Size: 2048 |
Author: 赵荣 |
Hits:
Description: NFA到DFA的转换，老师布置的作业，千辛万苦，拿出来和大家分享下-NFA to DFA conversion, the teacher assigned homework, go through untold hardships, out and share
Platform: |
Size: 543744 |
Author: 曹惠鹏 |
Hits:
Description: 本文件实现的是词法分析器 使用了JAVA语言来发 希望对大家有所帮助-NFA to dfa
Platform: |
Size: 163840 |
Author: 张三 |
Hits:
Description: NFA转化成DFA的课程实验，包括完整的实验理论知识，实验结果以及实验分析-The course experiment of NFA covert to DFA , including the complete experimental theoretical knowledge, experimental analysis and experimental results
Platform: |
Size: 61440 |
Author: dff |
Hits:
Description: Java实现有限自动机相关功能的工具包，包含：正则式与NFA,DFA的相互转化；DFA的交、并、差、补运算；判断一个DFA对应的正则集是否是无限集；列出一个有限正则集所包含的所有字符串，以及包含字符串的最小长度和最大长度；判断两个最小化DFA是否等价等。
代码已开源：https://a1e2w3@bitbucket.org/a1e2w3/dfa4java.git-Java implementation of finite automata related functions toolkit includes: transformation between regular expression, NFA and DFA. The intersect, complement, substract and union operation of DFA. Judge whether the corresponding regular sets of a DFA is an infinite set. Lists all the strings contain in a finite regular set, and calculate the minimum and maximum length of the strings contains. Determine whether the two minimized DFA equivalence or not, and so on.
Code is open source: https://a1e2w3 @ bitbucket.org/a1e2w3/dfa4java.git
Platform: |
Size: 141312 |
Author: 王聪 |
Hits:
Description: 不确定的有穷自动机转化为确定的有穷自动机的转换算法及实现-Uncertain finite automaton into a deterministic finite automaton conversion algorithm and implementation
Platform: |
Size: 897024 |
Author: 冷匕 |
Hits:
Description: java语言编程，编译原理中NFA转DFA程序。-java programming language, compiler theory NFA to DFA program.
Platform: |
Size: 20480 |
Author: 郑浩明 |
Hits:
Description: NFA化为DFA，并将DFA最小化，输出最小化后的DFA的状态转化矩阵。-NFA into a DFA, and minimize DFA, DFA minimize output condition after transformation matrix.
Platform: |
Size: 3072 |
Author: zhao |
Hits:
Description: Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags.
-Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags.
Platform: |
Size: 4096 |
Author: hykiekq |
Hits:
Description: 使用VC++实现了DFA和NFA的大部分功能，希望有需要的拿去-Use VC++ implements most of the functionality of DFA and NFA, hope there is a need take
Platform: |
Size: 3072 |
Author: zzx |
Hits: